A Faster Hardware Implementation of RSA Algorithm

The performance of most crypto systems is primarily determined by an efficient implementation of arithmetic operations. When implementing public key cryptography such as RSA the primary requirements are high speed arithmetic computation, small size and low power consumption and resistance to side channel attacks. In this paper an efficient way to explore fast modular operation has been explored, using redundant digit sets with higher radices and making modifications to Montgomery’s Algorithm in order to explore deep pipelining at architecture level which improves the throughput and latency of the system. This paper presents a solution to the problems of existing methods, proposes an actual implementation of the solution and demonstrates the benefit of the proposed approach. I suspect my algorithm to be nearly optimal and challenge the cryptographic community for better results.